Short proofs for online multiclass prediction on graphs
نویسندگان
چکیده
We present short proofs on the mistake bounds of the 1-nearest neighbor algorithm on an online prediction problem of path labels. The algorithm is one of key ingredients in the algorithm by Herbster, Lever, and Pontil for general graphs. Our proofs are combinatorial and naturally show that the algorithm works when the set of labels is not binary.
منابع مشابه
Efficient Online Multiclass Prediction on Graphs via Surrogate Losses
We develop computationally efficient algorithms for online multi-class prediction. Our construction is based on carefully-chosen data-dependent surrogate loss functions, and the new methods enjoy strong mistake bound guarantees. To illustrate the technique, we study the combinatorial problem of node classification and develop a prediction strategy that is linear-time per round. In contrast, the...
متن کاملLogistic Online Learning Methods and Their Application to Incremental Dependency Parsing
We investigate a family of update methods for online machine learning algorithms for cost-sensitive multiclass and structured classification problems. The update rules are based on multinomial logistic models. The most interesting question for such an approach is how to integrate the cost function into the learning paradigm. We propose a number of solutions to this problem. To demonstrate the a...
متن کاملAdaptive Online Traffic Flow Prediction Using Aggregated Neuro Fuzzy Approach
Short term prediction of traffic flow is one of the most essential elements of all proactive traffic control systems. Although various methodologies have been applied to forecast traffic parameters, several researchers have showed that compared with the individual methods, hybrid methods provide more accurate results . These results made the hybrid tools and approaches a more common method for ...
متن کاملEfficient Online Bandit Multiclass Learning with Õ(√T) Regret
We present an efficient second-order algorithm with Õ( 1 η √ T )1 regret for the bandit online multiclass problem. The regret bound holds simultaneously with respect to a family of loss functions parameterized by η, for a range of η restricted by the norm of the competitor. The family of loss functions ranges from hinge loss (η = 0) to squared hinge loss (η = 1). This provides a solution to the...
متن کاملEfficient Online Bandit Multiclass Learning with $\tilde{O}(\sqrt{T})$ Regret
We present an efficient second-order algorithm with Õ( 1 η √ T ) regret for the bandit online multiclass problem. The regret bound holds simultaneously with respect to a family of loss functions parameterized by η, for a range of η restricted by the norm of the competitor. The family of loss functions ranges from hinge loss (η = 0) to squared hinge loss (η = 1). This provides a solution to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 110 شماره
صفحات -
تاریخ انتشار 2010